On nonisomorphic Room squares

Secret Sharing Schemes Based on Room Squares

In this paper, we describe secret sharing schemes. We discuss Room squares and their critical sets. We propose a model of secret sharing based on critical sets of Room squares.

Compatibly ordered Room squares

Nonisomorphic Verdier Octahedra on the Same Base

0 Introduction 7 0.1 Is being a 3-triangle characterised by 2-triangles? . . . . . . . . . . . . . . . . . . . 7 0.2 Is being an n-triangle characterised by (n− 1)-triangles? . . . . . . . . . . . . . . . 8 0.3 An appendix on transport of structure . . . . . . . . . . . . . . . . . . . . . . . . . 9 0.4 Acknowledgements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 ...

Perfect Secret Sharing Schemes from Room Squares

Secret sharing schemes are one of the most important primitives in distributed systems In perfect secret sharing schemes collabo ration between unauthorised participants cannot reduce their uncer tainty about the secret This paper presents a perfect secret sharing scheme arising from critical sets of Room squares

An Example of Two Nonisomorphic Countable Ordered Abelian Groups with Isomorphic Lexicographical Squares

If M and Nare ordered groups, we denote by Mx N the group MxNequipped with the lexicographical order: (a,b) < (a',b') if and only if a < a' or {a = a' and b < b'). In [1], A. L. S. Corner gives an example of two countable abelian groups A, G such that G and A x A x G are isomorphic while G and A x G are not isomorphic; he also gives an example of two nonisomorphic countable abelian groups G, H ...